Probabilistic relevance ranking for collaborative filtering
نویسندگان
چکیده
منابع مشابه
Relevance Models for Collaborative Filtering Relevance Models for Collaborative Filtering
The Master said, " When I walk along with two others, they may serve me as my teachers. I will select their good qualities and follow them, their bad qualities and avoid them. " The Lunyu: BooK VII Shu'er Confucius, 551 BCE-479 BCE to my family for making it possible Summary Collaborative filtering is the common technique of predicting the interests of a user by collecting preference informatio...
متن کاملCollaborative Filtering Ensemble for Ranking
This paper provides the solution of the team “commendo” on the Track2 dataset of the KDD Cup 2011 Dror et al.. Yahoo Labs provides a snapshot of their music-rating database as dataset for the competition, consisting of approximately 62 million ratings from 250k users on 300k items. The dataset includes hierachical information about the items. The goal of the competition is to distinguish beteen...
متن کاملCollaborative Filtering with Localised Ranking
In recommendation systems, one is interested in the ranking of the predicted items as opposed to other losses such as the mean squared error. Although a variety of ways to evaluate rankings exist in the literature, here we focus on the Area Under the ROC Curve (AUC) as it widely used and has a strong theoretical underpinning. In practical recommendation, only items at the top of the ranked list...
متن کاملCollaborative Filtering with Localised Ranking
In recommendation systems, one is interested in the ranking of the predicted items as opposed to other losses such as the mean squared error. Although a variety of ways to evaluate rankings exist in the literature, here we focus on the Area Under the ROC Curve (AUC) as it widely used and has a strong theoretical underpinning. In practical recommendation, only items at the top of the ranked list...
متن کاملHierarchical Probabilistic Relational Models for Collaborative Filtering
This paper applies Probabilistic Relational Models (PRMs) to the Collaborative Filtering task, focussing on the EachMovie data set. We first learn a standard PRM, and show that its performance is competitive with the best known techniques. We then define a hierarchical PRM, which extends standard PRMs by dynamically refining classes into hierarchies, which improves the expressiveness as well as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Retrieval
سال: 2008
ISSN: 1386-4564,1573-7659
DOI: 10.1007/s10791-008-9060-1